منابع مشابه
Cliff-Edge Consensus: Agreeing on the Precipice
This paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need fo...
متن کاملCliff-edge model of obstetric selection in humans.
The strikingly high incidence of obstructed labor due to the disproportion of fetal size and the mother's pelvic dimensions has puzzled evolutionary scientists for decades. Here we propose that these high rates are a direct consequence of the distinct characteristics of human obstetric selection. Neonatal size relative to the birth-relevant maternal dimensions is highly variable and positively ...
متن کاملModeling Human Decision Making in Cliff-Edge Environments
In this paper we propose a model for human learning and decision making in environments of repeated Cliff-Edge (CE) interactions. In CE environments, which include common daily interactions, such as sealed-bid auctions and the Ultimatum Game (UG), the probability of success decreases monotonically as the expected reward increases. Thus, CE environments are characterized by an underlying conflic...
متن کاملCliff or step? Posture-specific learning at the edge of a drop-off.
Infants require locomotor experience to behave adaptively at a drop-off. However, different experimental paradigms (visual cliff and actual gaps and slopes) have generated conflicting findings regarding what infants learn and the specificity of their learning. An actual, adjustable drop-off apparatus was used to investigate whether learning to distinguish a step from a cliff transfers from craw...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2016
ISSN: 1029-8479
DOI: 10.1007/jhep10(2016)040